Higher Level Extremal Problems

نویسندگان

  • R. Ahlswede
  • N. Cai
  • Z. Zhang
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Extremal Effective Survey about Extremal Effective Cycles in Moduli Spaces of Curves

We survey recent developments and open problems about extremal effective divisors and higher codimension cycles in moduli spaces

متن کامل

Chain hexagonal cacti: extremal with respect to the eccentric connectivity index

In this paper we present explicit formulas for the eccentric connectivity index of three classes of chain hexagonal cacti. Further, it is shown that the extremal chain hexagonal cacti with respect to the eccentric connectivity index belong to one of the considered types. Some open problems and possible directions of further research are mentioned in the concluding section.

متن کامل

A new method for analytic determination of extremum of the transients in linear systems

Abstract: The relation between extremal values of the error and the coefficients of its differential equations is one of the central problems of control systems in chemical industry, because extremal values of the error sometimes cause serious damages to the environment or to the system itself. Analytical formulae for the determination of these values are known only for the second-order systems...

متن کامل

Extremal regularization

Extremal regularization finds a model fitting the data to a specified tolerance, and additionally minimizing an auxiliary criterion. It provides relative model/data space weights when no statistical information about the model or data is available other than an estimate of noise level. A version of the Moré-Hebden algorithm using conjugate gradients to solve the various linear systems implement...

متن کامل

DP-Complete Problems Derived from Extremal NP-Complete Properties

In contrast to the extremal variants of coNP-complete problems, which are frequently DP-complete, many extremal variants of NP-complete problems are in P. We investigate the extremal variants of two NP-complete problems, the extremal colorability problem with restricted degree and the extremal unfrozen non-implicant problem, and show that both of them are DP-complete. As far as we know, no extr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996